Galois-Tukey connection involving sets of metrics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooley - Tukey FFT on the Connection

We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make e ective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...

متن کامل

Cooley - Tukey FFT on the Connection MachineS

We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make eeective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...

متن کامل

computing character degrees via a galois connection

in a previous paper, the second author established that, given finite fields $f < e$ and certain subgroups $c leq e^times$, there is a galois connection between the intermediate field lattice ${l mid f leq l leq e}$ and $c$'s subgroup lattice. based on the galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product $c rtimes {rm gal} (e/f)$...

متن کامل

Computing Character Degrees via a Galois Connection

In a previous paper, the second author established that, given finite fields F < E and certain subgroups C ≤ E×, there is a Galois connection between the intermediate field lattice {L | F ≤ L ≤ E} and C’s subgroup lattice. Based on the Galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product C⋊Gal(E/F ). However, the analysis when |F | i...

متن کامل

Galois connection for multiple-output operations

It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary operations f : B n → B, and classes (coclones) of relations r ⊆ B k. We will present a generalization of this duality to classes of (multi-valued, partial) functions f : B n → B m , employing invariants valued in partia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tsukuba Journal of Mathematics

سال: 2012

ISSN: 0387-4982

DOI: 10.21099/tkbjm/1341951744